Optimal oblivious routing on d-dimensional meshes
نویسندگان
چکیده
منابع مشابه
Optimal Oblivious Routing On D-Dimensional Meshes
In this work we consider deterministic oblivious k-k routing algorithms with buffer size O(k). Our main focus lie is the design of algorithms for dimensional n n meshes, d> 1. For these networks we present asymptotically optimal O(kpnd) step oblivious k-k routing algorithms for all k and d > 1.
متن کاملOblivious Routing on d-Dimensional Meshes
We give new upper and lower bounds for oblivious permutation routing on d-dimensional meshes (d > 1) of side length n. We present O(nd=2 logn) algorithms for d 2 using queue-size 6. Further we present optimal O(nd=2) algorithms using unlimited queue-size. For odd d the presented algorithm is a d-bend algorithm. We further show that for odd d an algorithm which for every packet restrict the bend...
متن کاملOptimal oblivious routing under statistical uncertainty
In telecommunication networks, a common measure is the maximum congestion (i.e., utilisation) on edge capacity. As traffic demands are often known with a degree of uncertainty, network management techniques must take into account traffic variability. The oblivious performance of a routing is a measure of how congested the network may get, in the worst case, for one of a set of possible traffic ...
متن کاملOptimal Oblivious Routing in Hole-Free Networks
We study oblivious routing algorithms in which the packet paths are constructed independently of each other. Oblivious algorithms are inherently distributed and they can be designed to efficiently balance the network utilization. We give an oblivious routing algorithm for the class of hole-free networks, in which the nodes are topologically embedded in simple areas of the plane. Such networks a...
متن کاملA Lower Bound for Oblivious Dimensional Routing
In this work we consider deterministic oblivious dimensional routing algorithms on d-dimensional meshes. In oblivious dimensional routing algorithms the path of a packet depends only on the source and destination node of the packet. Furthermore packets use a shortest path with a minimal number of bends. We present an Ω(kn(d+1)/2) step lower bound for oblivious dimensional k-k routing algorithms...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.04.016